TSTP Solution File: ITP135^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP135^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:05 EDT 2024
% Result : Theorem 0.44s 0.67s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 24 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 67 ( 4 ~; 0 |; 0 &; 63 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
paraco1605129243lle_tv: $tType ).
thf(decl_sort3,type,
list_char: $tType ).
thf(decl_sort4,type,
paraco1604210848lle_fm: $tType ).
thf(decl_53,type,
paraco761681009ge_int: ( nat > nat ) > ( list_char > paraco1605129243lle_tv ) > list_char > paraco1605129243lle_tv ).
thf(decl_54,type,
paraco1147068288nge_tv: ( nat > nat ) > paraco1605129243lle_tv > paraco1605129243lle_tv ).
thf(decl_56,type,
paraco1325918602e_eval: ( list_char > paraco1605129243lle_tv ) > paraco1604210848lle_fm > paraco1605129243lle_tv ).
thf(decl_63,type,
paraco1344940915le_Det: $o > paraco1605129243lle_tv ).
thf(decl_155,type,
f: nat > nat ).
thf(decl_156,type,
i: list_char > paraco1605129243lle_tv ).
thf(decl_158,type,
p2: paraco1604210848lle_fm ).
thf(conj_0,conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.0kIFeVpLpI/E---3.1_18991.p',conj_0) ).
thf(fact_2_ih2,axiom,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1147068288nge_tv @ f @ ( paraco1325918602e_eval @ i @ p2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0kIFeVpLpI/E---3.1_18991.p',fact_2_ih2) ).
thf(fact_0_a,axiom,
( ( paraco1325918602e_eval @ i @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.0kIFeVpLpI/E---3.1_18991.p',fact_0_a) ).
thf(fact_1__092_060open_062change__tv_Af_A_Ieval_Ai_Ap2_J_A_061_ADet_ATrue_092_060close_062,axiom,
( ( paraco1147068288nge_tv @ f @ ( paraco1325918602e_eval @ i @ p2 ) )
= ( paraco1344940915le_Det @ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.0kIFeVpLpI/E---3.1_18991.p',fact_1__092_060open_062change__tv_Af_A_Ieval_Ai_Ap2_J_A_061_ADet_ATrue_092_060close_062) ).
thf(c_0_4,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1147068288nge_tv @ f @ ( paraco1325918602e_eval @ i @ p2 ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_ih2]) ).
thf(c_0_7,plain,
( ( paraco1325918602e_eval @ i @ p2 )
= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[fact_0_a]) ).
thf(c_0_8,negated_conjecture,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
!= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( paraco1325918602e_eval @ ( paraco761681009ge_int @ f @ i ) @ p2 )
= ( paraco1147068288nge_tv @ f @ ( paraco1344940915le_Det @ $true ) ) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
( ( paraco1147068288nge_tv @ f @ ( paraco1325918602e_eval @ i @ p2 ) )
= ( paraco1344940915le_Det @ $true ) ),
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062change__tv_Af_A_Ieval_Ai_Ap2_J_A_061_ADet_ATrue_092_060close_062]) ).
thf(c_0_11,negated_conjecture,
( ( paraco1147068288nge_tv @ f @ ( paraco1344940915le_Det @ $true ) )
!= ( paraco1344940915le_Det @ $true ) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.19 % Problem : ITP135^1 : TPTP v8.1.2. Released v7.5.0.
% 0.18/0.20 % Command : run_E %s %d THM
% 0.20/0.41 % Computer : n031.cluster.edu
% 0.20/0.41 % Model : x86_64 x86_64
% 0.20/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41 % Memory : 8042.1875MB
% 0.20/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41 % CPULimit : 300
% 0.20/0.41 % WCLimit : 300
% 0.20/0.41 % DateTime : Fri May 3 13:03:02 EDT 2024
% 0.20/0.41 % CPUTime :
% 0.26/0.61 Running higher-order theorem proving
% 0.44/0.61 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0kIFeVpLpI/E---3.1_18991.p
% 0.44/0.67 # Version: 3.1.0-ho
% 0.44/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.44/0.67 # Starting new_ho_4 with 300s (1) cores
% 0.44/0.67 # Starting lpo5_fix with 300s (1) cores
% 0.44/0.67 # full_lambda_7 with pid 19071 completed with status 0
% 0.44/0.67 # Result found by full_lambda_7
% 0.44/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.44/0.67 # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.44/0.67 # Search class: HGUSM-FSLM31-DHSFFMBN
% 0.44/0.67 # partial match(1): HGUSM-FSLM31-DHSFFFBN
% 0.44/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.67 # Starting new_bool_5 with 135s (1) cores
% 0.44/0.67 # new_bool_5 with pid 19075 completed with status 0
% 0.44/0.67 # Result found by new_bool_5
% 0.44/0.67 # Preprocessing class: HSLMSMSMSSMNHSA.
% 0.44/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.67 # Starting new_ho_10 with 1500s (5) cores
% 0.44/0.67 # Starting full_lambda_7 with 300s (1) cores
% 0.44/0.67 # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.44/0.67 # Search class: HGUSM-FSLM31-DHSFFMBN
% 0.44/0.67 # partial match(1): HGUSM-FSLM31-DHSFFFBN
% 0.44/0.67 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.44/0.67 # Starting new_bool_5 with 135s (1) cores
% 0.44/0.67 # Preprocessing time : 0.007 s
% 0.44/0.67 # Presaturation interreduction done
% 0.44/0.67
% 0.44/0.67 # Proof found!
% 0.44/0.67 # SZS status Theorem
% 0.44/0.67 # SZS output start CNFRefutation
% See solution above
% 0.44/0.67 # Parsed axioms : 518
% 0.44/0.67 # Removed by relevancy pruning/SinE : 409
% 0.44/0.67 # Initial clauses : 335
% 0.44/0.67 # Removed in clause preprocessing : 43
% 0.44/0.67 # Initial clauses in saturation : 292
% 0.44/0.67 # Processed clauses : 15
% 0.44/0.67 # ...of these trivial : 0
% 0.44/0.67 # ...subsumed : 2
% 0.44/0.67 # ...remaining for further processing : 12
% 0.44/0.67 # Other redundant clauses eliminated : 0
% 0.44/0.67 # Clauses deleted for lack of memory : 0
% 0.44/0.67 # Backward-subsumed : 0
% 0.44/0.67 # Backward-rewritten : 1
% 0.44/0.67 # Generated clauses : 0
% 0.44/0.67 # ...of the previous two non-redundant : 1
% 0.44/0.67 # ...aggressively subsumed : 0
% 0.44/0.67 # Contextual simplify-reflections : 0
% 0.44/0.67 # Paramodulations : 0
% 0.44/0.67 # Factorizations : 0
% 0.44/0.67 # NegExts : 0
% 0.44/0.67 # Equation resolutions : 0
% 0.44/0.67 # Disequality decompositions : 0
% 0.44/0.67 # Total rewrite steps : 4
% 0.44/0.67 # ...of those cached : 2
% 0.44/0.67 # Propositional unsat checks : 0
% 0.44/0.67 # Propositional check models : 0
% 0.44/0.67 # Propositional check unsatisfiable : 0
% 0.44/0.67 # Propositional clauses : 0
% 0.44/0.67 # Propositional clauses after purity: 0
% 0.44/0.67 # Propositional unsat core size : 0
% 0.44/0.67 # Propositional preprocessing time : 0.000
% 0.44/0.67 # Propositional encoding time : 0.000
% 0.44/0.67 # Propositional solver time : 0.000
% 0.44/0.67 # Success case prop preproc time : 0.000
% 0.44/0.67 # Success case prop encoding time : 0.000
% 0.44/0.67 # Success case prop solver time : 0.000
% 0.44/0.67 # Current number of processed clauses : 11
% 0.44/0.67 # Positive orientable unit clauses : 5
% 0.44/0.67 # Positive unorientable unit clauses: 0
% 0.44/0.67 # Negative unit clauses : 6
% 0.44/0.67 # Non-unit-clauses : 0
% 0.44/0.67 # Current number of unprocessed clauses: 278
% 0.44/0.67 # ...number of literals in the above : 1231
% 0.44/0.67 # Current number of archived formulas : 0
% 0.44/0.67 # Current number of archived clauses : 1
% 0.44/0.67 # Clause-clause subsumption calls (NU) : 0
% 0.44/0.67 # Rec. Clause-clause subsumption calls : 0
% 0.44/0.67 # Non-unit clause-clause subsumptions : 0
% 0.44/0.67 # Unit Clause-clause subsumption calls : 3
% 0.44/0.67 # Rewrite failures with RHS unbound : 0
% 0.44/0.67 # BW rewrite match attempts : 1
% 0.44/0.67 # BW rewrite match successes : 1
% 0.44/0.67 # Condensation attempts : 15
% 0.44/0.67 # Condensation successes : 0
% 0.44/0.67 # Termbank termtop insertions : 28016
% 0.44/0.67 # Search garbage collected termcells : 9348
% 0.44/0.67
% 0.44/0.67 # -------------------------------------------------
% 0.44/0.67 # User time : 0.026 s
% 0.44/0.67 # System time : 0.007 s
% 0.44/0.67 # Total time : 0.034 s
% 0.44/0.67 # Maximum resident set size: 3868 pages
% 0.44/0.67
% 0.44/0.67 # -------------------------------------------------
% 0.44/0.67 # User time : 0.040 s
% 0.44/0.67 # System time : 0.013 s
% 0.44/0.67 # Total time : 0.053 s
% 0.44/0.67 # Maximum resident set size: 2844 pages
% 0.44/0.67 % E---3.1 exiting
% 0.44/0.67 % E exiting
%------------------------------------------------------------------------------